#include <cstdio>
#include <memory>
#include <cstdlib>
#include "../TreesAndGraphs/Trees/BinaryTree.h"
/*
Author: Shakti Prasad Misra
License: GPL2
Revesion: 0.1v
All usage of this file is permitted, for free software or commercial. 
But the Author name should not be changed. If changes are done please add it to the changed section.
*/
using namespace tng;
int main(int argc, char *argv[])
{
    //basic_string <char>::iterator str1_cIter;

    class test
    {
    test* t1, *t2, *p;
    unsigned long int _keyval1;
    unsigned long int _data;
    unsigned long int t;
    };

    unsigned long int i = 0;

    typedef 
        TreeNode<unsigned long int,/*KeyVal*/
        unsigned long int,/*dataType*/
        binNodeTrait/*traits*/, 
        1/*maxKeys*/, 
        3/*maxNodes = maxKeys + 1*/> 
        BinTreeNode;
BinaryTree<unsigned long int, unsigned long int, std::allocator<BinTreeNode> > bnt;
bnt.initTree(i, ++i);
bnt.createNAddNode(++i, ++i);
BinaryTree<unsigned long int, unsigned long int, std::allocator<BinTreeNode> > test1;
    printf("size = %d\n",sizeof(BinaryTree<unsigned long int, unsigned long int, std::allocator<BinTreeNode> >));
    printf("size = %d\n",sizeof(test));
    printf("size = %d\n",sizeof(TreeNode<unsigned long int, unsigned long int, unsigned long int , 1>));

    return 0;
}

